Distributed Synthesis with Incomparable Information
نویسندگان
چکیده
Given (1) an architecture defined by processes and communication channels between them or with the environment, and (2) a specification on the messages transmitted over the channels, distributed synthesis aims at deciding existence of local programs, one for each process, that together meet the specification, whatever the environment does. Recent work shows that this problem can be solved when a linear preorder sorts the agents w.r.t. the information received from the environment. In this paper we show a new decidability result in the case where this preorder is broken by the addition of noisy agents embedded in a pipeline architecture. This case cannot be captured by the classical framework. Besides, this architecture makes it possible to model particular security threats, known as covert channels, where two users (the sender and the receiver) manage to communicate via a noisy protocol, and despite incomparable views over the environment.
منابع مشابه
Fair Exchange Is Incomparable to Consensus
In asynchronous systems where processes are prone to crash failures, we show that fair exchange is incomparable to distributed consensus. By incomparability we mean there exist failure detector classes that solve fair exchange and not distributed consensus, and vice versa. Remarkably, this is in contrast to the folklore belief that solving fair exchange is generally harder than solving distribu...
متن کاملElection and rendezvous with incomparable labels
In “Can we elect if we cannot compare” (SPAA’03), Barrière, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment,...
متن کاملGeneral classes of impossible operations through the existence of incomparable states
In this work we show that the most general class of anti-unitary operators are nonphysical in nature through the existence of incomparable pure bipartite entangled states. It is also shown that a large class of inner-product-preserving operations defined only on the three qubits having spin-directions along x, y and z are impossible. If we perform such an operation locally on a particular pure ...
متن کاملA Classification of Incomparable States
Let {|ψ〉 , |φ〉} be an incomparable pair of states (|ψ〉 = |φ〉), i.e., |ψ〉 and |φ〉 cannot be transformed to each other with probability one by local transformations and classical communication (LOCC). We show that incomparable states can be multiple-copy transformable, i.e., there can exist a k, such that |ψ〉 → |φ〉, i.e., k+1 copies of |ψ〉 can be transformed to k + 1 copies of |φ〉 with probabilit...
متن کاملInformation and multi-sensor coordination
The control and integration of distributed, multi-sensor per ceptual systems is a complex and challenging problem. The observations or opinions of different sensors are often dis parate, incomparable and are usually only partial views. Sensor information is inherently uncertain, and in addition the individual sensors may themselves be in error with re spect to the system as a whole. The succ...
متن کامل